A Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance

نویسندگان

  • BERNHARD HAEUPLER
  • TELIKEPALLI KAVITHA
  • SIDDHARTHA SEN
  • ROBERT E. TARJAN
چکیده

A preliminary version of this article appeared in Proceedings of the 35th International Colloquium on Automata, Languages, and Programming (ICALP), Reykjavik, Iceland, July 7-11, 2008. Author’s addresses: Bernhard Haeupler, CSAIL, Massachusetts Institute of Technology, Cambridge, MA 02139, United States, [email protected]; work done while the author was a visiting student at Princeton University). Telikepalli Kavitha, Tata Institute of Fundamental Research, Mumbai, India, [email protected]. Rogers Mathew, Indian Institute of Science, Bangalore, India, [email protected]. Siddhartha Sen, Department of Computer Science, Princeton University, Princeton, NJ 08540, United States, [email protected]. Robert E. Tarjan, Department of Computer Science, Princeton University, Princeton, NJ 08540, United States and HP Laboratories, Palo Alto, CA 94304, United States, [email protected]. Research at Princeton University partially supported by NSF grants CCF-0830676 and CCF-0832797. The information contained herein does not necessarily reflect the opinion or policy of the federal government and no official endorsement should be inferred. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies show this notice on the first page or initial screen of a display along with the full citation. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, to redistribute to lists, or to use any component of this work in other works requires prior specific permission and/or a fee. Permissions may be requested from Publications Dept., ACM, Inc., 2 Penn Plaza, Suite 701, New York, NY 10121-0701 USA, fax +1 (212) 869-0481, or [email protected]. c © YYYY ACM 1549-6325/YYYY/01-ARTA $10.00 DOI 10.1145/0000000.0000000 http://doi.acm.org/10.1145/0000000.0000000

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Incremental Topological Ordering and Strong Component Maintenance

We present an on-line algorithm for maintaining a topological order of a directed acyclic graph as arcs are added, and detecting a cycle when one is created. Our algorithm takes O(m) amortized time per arc, where m is the total number of arcs. For sparse graphs, this bound improves the best previous bound by a logarithmic factor and is tight to within a constant factor for a natural class of al...

متن کامل

Economic order quantity model for growing items with incremental quantity discounts

Certain inventory items are living organisms, for example livestock, and are therefore capable of growing during the replenishment cycle. These items often serve as various saleable food items downstream in supply chains. The purpose of this paper is to develop a lot sizing model for growing items if the supplier of the items offers incremental quantity discounts. A mathematical model is derive...

متن کامل

Faster Algorithms for Online Topological Ordering

We present two algorithms for maintaining the topological order of a directed acyclic graph with n vertices, under an online edge insertion sequence of m edges. Efficient algorithms for online topological ordering have many applications, including online cycle detection, which is to discover the first edge that introduces a cycle under an arbitrary sequence of edge insertions in a directed grap...

متن کامل

The topological ordering of covering nodes

The topological ordering algorithm sorts nodes of a directed graph such that the order of the tail of each arc is lower than the order of its head. In this paper, we introduce the notion of covering between nodes of a directed graph. Then, we apply the topological orderingalgorithm on graphs containing the covering nodes. We show that there exists a cut set withforward arcs in these...

متن کامل

Dynamic anomaly detection by using incremental approximate PCA in AODV-based MANETs

Mobile Ad-hoc Networks (MANETs) by contrast of other networks have more vulnerability because of having nature properties such as dynamic topology and no infrastructure. Therefore, a considerable challenge for these networks, is a method expansion that to be able to specify anomalies with high accuracy at network dynamic topology alternation. In this paper, two methods proposed for dynamic anom...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011